Sparse Learning-to-Rank via an Efficient Primal-Dual Algorithm
نویسندگان
چکیده
منابع مشابه
An Efficient Primal-Dual Algorithm for Fair Combinatorial Optimization Problems
We consider a general class of combinatorial optimization problems including among others allocation, multiple knapsack, matching or travelling salesman problems. The standard version of those problems is the maximum weight optimization problem where a sum of values is optimized. However, the sum is not a good aggregation function when the fairness of the distribution of those values (correspon...
متن کاملAn efficient algorithm for rank-1 sparse PCA
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the original PCA to achieve sparsity. In this paper, we introduce an efficient algorithm to find a single sparse principal component with a specified cardinality. The algorithm consists of two stages. In the first stage, it identifies an active index set with desired cardinality corresponding to the nonzero ...
متن کاملSparse Linear Programming via Primal and Dual Augmented Coordinate Descent
Over the past decades, Linear Programming (LP) has been widely used in differentareas and considered as one of the mature technologies in numerical optimization.However, the complexity offered by state-of-the-art algorithms (i.e. interior-pointmethod and primal, dual simplex methods) is still unsatisfactory for problems inmachine learning with huge number of variables and constr...
متن کاملThe Primal - dual Algorithm
As we have seen before, using strong duality, we know that the optimum value for the following two linear programming are equal, i.e. u = w, if they are both feasible. u = max{cx : Ax ≤ b, x ≥ 0} (P ) w = min{b y : A y ≥ c, y ≥ 0} (D) Using the above result, we can check the optimality of a primal and/or a dual solution. Theorem 1. Suppose x and y are feasible solutions to (P ) and (D). Then x ...
متن کاملAn efficient algorithm to rank Web resources
How to rank Web resources is critical to Web Resource Discovery (Search Engine). This paper not only points out the weakness of current approaches, but also presents in-depth analysis of the multidimensionality and subjectivity of rank algorithms. From a dynamics viewpoint, this paper abstracts a user’s Web surfing action as a Markov model. Based on this model, we propose a new rank algorithm. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2013
ISSN: 0018-9340
DOI: 10.1109/tc.2012.62